Ant Colony Component-based System for Traveling Salesman Problem
نویسنده
چکیده
A component-based approach to model Ant Colony System (ACS) for the Traveling Salesman Problem (TSP) is shown in this paper. The used components to solve the TSP with ACS technique and the collaboration rules between components are also described. The internal reasoning about the ant colony component-based system for the TSP gives a better perception of solving this problem using ant-based techniques. Mathematics Subject Classification: 05C85, 90C35, 68N19
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملAnt colony system with communication strategies
In this paper an ant colony system (ACS) with communication strategies is developed. The artificial ants are partitioned into several groups. Seven communication methods for updating the pheromone level between groups in ACS are proposed and work on the traveling salesman problem using our system is presented. Experimental results based on three well-known traveling salesman data sets demonstra...
متن کاملAnt Colony Optimization (ACO) For The Traveling Salesman Problem (TSP) Using Partitioning
An ant colony optimization is a technique which was introduced in 1990’s and which can be applied to a variety of discrete (combinatorial) optimization problem and to continuous optimization. The ACO algorithm is simulated with the foraging behavior of the real ants to find the incremental solution constructions and to realize a pheromone laying-and-following mechanism. This pheromone is the in...
متن کاملMulti-type ant colony system for solving the multiple traveling salesman problem
The Multiple Traveling Salesman problem (mTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where more than one salesman is allowed to be used in order to visit some cities just once. Furthermore, the formulation of the mTSP applies to a wide range of reallife applications, and can be extended to a wide variety of Vehicle Routing Problems (VRPs) by incorporating some addi...
متن کاملAnt Colony Optimization with Memory and Its Application to Traveling Salesman Problem
proposed to improve the performance of the ACO algorithm. In this paper an ant colony optimization with memory is proposed, which is applied to the classical traveling salesman problem (TSP). In the proposed algorithm, each ant searches the solution not only according to the pheromone and heuristic information but also based on the memory which is from the solution of the last iteration. A larg...
متن کامل